On interleaving behaviour of PT-nets

Abstract Interleaving Semantics for Reconfigurable Petri Nets

Interleaving Semantics for Reconfigurable Petri Nets

Branching processes of communication structured PT-nets

Communication structured occurrence nets (CSON) are an extension of occurrence nets. They can be used to represent the execution behaviours of complex evolving systems. Communication structured place transition nets (CSPT-nets) provide a system-level model for describing the interaction between different systems, and CSONs can model individual runs of CSPT-nets. In this paper, we investigate br...

Infinite Behaviour of Petri Nets

Semantics of parallelism - non-interleaving representation of behaviour

Want to get experience? Want to get any ideas to create new things in your life? Read semantics of parallelism non interleaving representation of behaviour now! By reading this book as soon as possible, you can renew the situation to get the inspirations. Yeah, this way will lead you to always think more and more. In this case, this book will be always right for you. When you can observe more a...

On interleaving in {P,A}-Time Petri nets with strong semantics

This paper deals with the reachability analysis of {P,A}-Time Petri nets ({P,A}-TPN in short) in the context of strong semantics. It investigates the convexity of the union of state classes reached by different interleavings of the same set of transitions. In [6], the authors have considered the T-TPN model and its Contracted State Class Graph (CSCG) [7] and shown that this union is not necessa...